Some Results on Exclusive Sum Labelings of Hypergraphs

نویسندگان

  • Martin Sonntag
  • Hanns-Martin Teichert
چکیده

We generalize the concept of exclusive sum labelings of graphs (cf. [?]) and determine the exclusive sum number for several classes of hypergraphs. The results disclose a significant difference between graphs (i.e. 2-uniform hypergraphs) and ”genuine” hypergraphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

no-homomorphism conditions for hypergraphs

In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.

متن کامل

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

Vertex Magic Total Labelings of Graphs

A vertex magic total labeling of a graph with v vertices and e edges is de ned as a one to one map taking the vertices and edges onto the integers v e with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex Properties of these labelings are studied It is shown how to construct labelings for several families o...

متن کامل

CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2015